Fractal Analysis of Overlapping Box Covering Algorithm for Complex Networks
نویسندگان
چکیده
منابع مشابه
Box-covering algorithm for fractal dimension of complex networks.
The self-similarity of complex networks is typically investigated through computational algorithms, the primary task of which is to cover the structure with a minimal number of boxes. Here we introduce a box-covering algorithm that outperforms previous ones in most cases. For the two benchmark cases tested, namely, the E. coli and the World Wide Web (WWW) networks, our results show that the imp...
متن کاملOptimal box-covering algorithm for fractal dimension of complex networks
Christian M. Schneider, 2, ∗ Tobias A. Kesselring, José S. Andrade Jr., and Hans J. Herrmann 3 Computational Physics, IfB, ETH Zurich, Schafmattstrasse 6, 8093 Zurich, Switzerland Department of Civil and Environmental Engineering, MIT, 77 Massachusetts Avenue, Cambridge, MA 02139, USA Departamento de F́ısica, Universidade Federal do Ceará, 60451-970 Fortaleza, Ceará, Brazil (Dated: February 25, ...
متن کاملBox-covering algorithm for fractal dimension of weighted networks.
Box-covering algorithm is a widely used method to measure the fractal dimension of complex networks. Existing researches mainly deal with the fractal dimension of unweighted networks. Here, the classical box covering algorithm is modified to deal with the fractal dimension of weighted networks. Box size length is obtained by accumulating the distance between two nodes connected directly and gra...
متن کاملA box-covering algorithm for fractal scaling in scale-free networks.
A random sequential box-covering algorithm recently introduced to measure the fractal dimension in scale-free (SF) networks is investigated. The algorithm contains Monte Carlo sequential steps of choosing the position of the center of each box; thereby, vertices in preassigned boxes can divide subsequent boxes into more than one piece, but divided boxes are counted once. We find that such box-s...
متن کاملHow to calculate the fractal dimension of a complex network: the box covering algorithm
Covering a network with the minimum possible number of boxes can reveal interesting features for the network structure, especially in terms of self-similar or fractal characteristics. Considerable attention has been recently devoted to this problem, with the finding that many real networks are self-similar fractals. Here we present, compare and study in detail a number of algorithms that we hav...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.2981044